Quantum fast Fourier transform using multilevel atoms
نویسندگان
چکیده
منابع مشابه
Quantum fast Fourier transform using multilevel atoms
We propose an implementation of the quantum fast Fourier transform algorithm in an entangled system of multilevel atoms. The Fourier transform occurs naturally in the unitary time evolution of energy eigenstates and is used to de®ne an alternative wave-packet basis for quantum information in the atom. A change of basis from energy levels to wave packets amounts to a discrete quantum Fourier tra...
متن کاملUsing Fast Fourier Transform in the 3-d Multilevel Fast Multipole Algorithm
In this paper a method is presented how to perform interpolation and anterpolation in both spherical coordinates θ and φ by trigonometric polynomials and the fast Fourier transform (FFT) in the 3-D multilevel fast multipole algorithm (MLFMA). The proposed method is exact in interpolation and anterpolation, and has the high numerical efficiency of FFT. A numerical comparison suggests that the pr...
متن کاملArithmetic Circuits for Multilevel Qudits Based on Quantum Fourier Transform
We present some basic integer arithmetic quantum circuits, such as adders and multipliers-accumulators of various forms, as well as diagonal operators, which operate on multilevel qudits. The integers to be processed are represented in an alternative basis after they have been Fourier transformed. Several arithmetic circuits operating on Fourier transformed integers have appeared in the literat...
متن کاملOption Valuation Using the Fast Fourier Transform
This paper shows how the fast Fourier Transform may be used to value options when the characteristic function of the return is known analytically.
متن کاملUsing a Fast Fourier Transform Algorithm
The symmetry and periodicity properties of the discrete Fourier transform (DFT) allow a variety of useful and interesting decompositions. In particular, by clever grouping and reordering of the complex exponential multiplications it is possible to achieve substantial computational savings while still obtaining the exact DFT solution (no approximation required). Many “fast” algorithms have been ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Modern Optics
سال: 2002
ISSN: 0950-0340,1362-3044
DOI: 10.1080/09500340210123947